RELIABILITY ANALYSIS OF M/G/1 REPAIRABLE QUEUEING SYSTEM WITH MULTIPLE ADAPTIVE VACATIONS AND p-ENTERING DISCIPLINE
نویسندگان
چکیده
This paper considers the reliability of an M/G/1 queue with multiple adaptive vacations in which the arriving customers enter the system with probability p (0<p≤1) during vacations. Through appropriate assumptions, the model is studied by the total probability decomposition technique and the tool of Laplace transform. Some reliability indices are studied. Moreover, we give some numerical examples to observe the effect of various parameters on the reliability indices. Key WordsReliability, Multiple adaptive vacations, Queue, p-entering discipline
منابع مشابه
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
This paper presents an analysis for an M/M/1/N queueing system with balking, reneging and server vacations. Arriving customers balk (do not enter) with a probability and renege (leave the queue after entering) according to a negative exponential distribution. It is assumed that the server has a multiple vacation. By using the Markov process method, we first develop the equations of the steady s...
متن کاملAnalysis of Finite Buffer Markovian Queue with Balking, Reneging and Working Vacations
This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...
متن کاملSteady State Analysis of Repairable M/G/1 Retrial Queuing Model with Modified Server Vacation Balking and Optional Reservice
A retrial queue with general retrial times, modified vacation policy and Bernoulli feedback is analyzed in this paper. If the server is busy or on vacation, an arriving customer either enters on orbit with probability b, or balks with probability 1-b. Otherwise the service of the arriving customer commences immediately. At the service completion epoch, the test customer may either enter the orb...
متن کاملAnalysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control
We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on ...
متن کاملA Batch Arrival Queue System with Coxian-2 Server Vacations and Admissibility Restricted
The M/G/1 classic queueing system were extended by many authors in last two decades. The systems with server’s vacation are important models that extend the M/G/1 queueing system. Also another conditions such as admissibility restricted may occure in systems. From this motivation, in this system I consider a single server queue with batch arrival Poisson input. There is a restricted admissibili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014